The cover times of random walks on random uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
The cover times of random walks on random uniform hypergraphs
Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and solutions based on random walks require a notion of random walks in hypergraphs. At each step, a random walk on a hypergraph moves from its curre...
متن کاملThe Cover Times of Random Walks on Hypergraphs
Random walks in graphs have been applied to various network exploration and networkmaintenance problems. In some applications, however, it may be more natural, and moreaccurate, to model the underlying network not as a graph but as a hypergraph, and solutionsbased on random walks require a notion of random walks in hypergraphs. While randomwalks in graphs have been extensive...
متن کاملCover Times of Random Walks on Finite Graphs
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to hit all the vertices of the graph. For our senior integrative exercise in the Department of Mathematics at Carleton College, we investigated the problem of finding whatever information we could (expectation, variance, or exact distribution) about the cover times for random walks on certain types o...
متن کاملNon Uniform Random Walks
Given εi ∈ [0,1) for each 1 < i < n, a particle performs the following random walk on {1,2, . . . ,n}: If the particle is at n, it chooses a point uniformly at random (u.a.r.) from {1, . . . ,n− 1}. If the current position of the particle is m (1 < m < n), with probability εm it decides to go back, in which case it chooses a point u.a.r. from {m + 1, . . . ,n}. With probability 1− εm it decides...
متن کاملGossip and mixing times of random walks on random graphs
Motivated by applications to sensor and ad hoc networks, we study distributed algorithms for passing information and for computing averages in an arbitrarily connected network of nodes. Our work draws upon and contributes to a growing body of literature in three areas: (i) Distributed averaging algorithms, as formulated in Kempe, Dobra and Gehrke (2003), (ii) geometric random graph models for l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.01.020